package com.faiz.algorithm;




public class BinaryTreeTraversal {

    //二叉树的中序遍历
    public static void solution1(BinaryTree root) {
        if (root != null) {
            solution1(root.getLeft());
            System.out.println(root.getValue());
            solution1(root.getRight());
        }
    }

//    public static void printBinaryTree(BinaryTree tree) {
//        if ()
//    }
}
